Minimal Tolerance Pairs for System Z-Like Ranking Functions for First-Order Conditional Knowledge Bases
نویسندگان
چکیده
In system Z, reasoning is done with respect to a unique minimal ranking function obtained from a partitioning of the conditionals in a knowledge base. In this paper, we extend system Z, a recent proposal for a system Z-like approch to firstorder conditionals. We introduce the notion of tolerance pair and show how sceptical Z-inference can be defined and implemented by taking all minimal tolerance pairs into account.
منابع مشابه
A structural base for conditional reasoning
There are several approaches implementing reasoning based on conditional knowledge bases, one of the most popular being System Z [1]. We look at ranking functions [2] in general, conditional structures and crepresentations [3] in order to examine the reasoning strength of the different approaches by learning which of the known calculi of nonmonotonic reasoning (System P and R) and Direct Infere...
متن کاملVariable-Strength Conditional Preferences for Matchmaking in Description Logics
We present an approach to variable-strength conditional preferences for matchmaking and ranking objects in description logics. In detail, we introduce conditional preference bases, which consist of a description logic knowledge base and a finite set of variable-strength conditional preferences, and which are associated with a formal semantics based on ranking functions. We then define the notio...
متن کاملRanking Revision with Conditional Knowledge Bases
We introduce a new model for belief dynamics where the belief states are ranking measures and the informational inputs are finite sets of parametrized conditionals interpreted by ranking constraints. The approach is inspired by the minimal information paradigm and generalizes ranking construction strategies developed for default reasoning. We show its handling of principles for conditional and ...
متن کاملIntensional Combination of Rankings for OCF-Networks
Similar to Bayesian networks, so-called OCF-networks combine structural information encoded in a directed graph with qualitative information expressed by ranking degrees of (conditional) formulas. The benefits of such techniques are twofold: First, the high complexity of the semantical ranking functions approach is reduced substantially, and second, global ranks are obtained from local informat...
متن کاملVariable-Strength Conditional Preferences for Ranking Objects in Ontologies
We introduce conditional preference bases as a means for ranking objects in ontologies. Conditional preference bases consist of a description ogic knowledge base and a finite set of conditional preferences, which are statements of the form “generally, in the context φ, property α is referred over property ¬α with strength s”. They are inspired by variable-strength defaults in conditional knowle...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016